Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs
نویسندگان
چکیده
Jianqiang Hao 1,2,*, Yunzhan Gong 1, Yawen Wang 1, Li Tan 2 and Jianzhi Sun 2 1 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, 100876 Beijing, China; [email protected] (Y.G.); [email protected] (Y.W.) 2 School of Computer and Information Engineering, Beijing Technology and Business University, 100048 Beijing, China; [email protected] (L.T.); [email protected] (J.S.) * Correspondence: [email protected]; Tel.: +86-10-6898-5704
منابع مشابه
The acyclic disconnection of a digraph
In this paper we introduce a numerical invariant of digraphs which generalizes that of the number of connected components of a graph. The ao,clic disconnection ~(D) of a digraph D is the minimum number of (weakly) connected components of the subdigraphs obtained from D by deleting an acyclic set of arcs. We state some results about this invariant and compute its value for a variety of circulant...
متن کاملSubdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum outdegree d and diameter k. An upper bound is given by the Moore bound M(d, k) = ∑k i=0 d i and almost Moore digraphs are digraphs with maximum out-degree d, diameter k and order M(d, k)− 1. In this paper we will look at the structure of subdigraphs of almost...
متن کاملExtremal Energy of Digraphs with Two Linear Subdigraphs
The eigenvalues of a digraph are the eigenvalues of its adjacency matrix. The sum of the absolute values of the real part of the eigenvalues is called the energy of the digraph. The extremal energy of bicyclic digraphs with vertex-disjoint directed cycles is known. In this paper, we consider a class of bicyclic digraphs with exactly two linear subdigraphs of equal length. We find the minimal an...
متن کاملThe Diameter of Cyclic Kautz Digraphs
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphsMCK(d, ) and it is derived from the Kautz...
متن کاملMagic graphs and the faces of the Birkhoff polytope
ABSTRACT Magic labelings of graphs are studied in great detail by Stanley in [18] and [19], and Stewart in [20] and [21]. In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhedral cones and Ehrhart quasi-polynomials of polytopes. We define polytopes of magic labelings of graphs and digraphs. We give a description of the faces of the Birkhoff polytop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 19 شماره
صفحات -
تاریخ انتشار 2017